Contact process on regular tree with random vertex weights
نویسندگان
چکیده
منابع مشابه
Minimum Spanning Tree with Uncertain Random Weights
This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum spanning tree problem with uncertain random edge weights. A model is presented to formulate a specific minimum spanning tree problem with uncertain random edge weights involving a distance chance distr...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملThe Contact Process on the Complete Graph with Random Vertex-dependent Infection Rates
We study the contact process on the complete graph on n vertices where the rate at which the infection travels along the edge connecting vertices i and j is equal to λwiwj/n for some λ > 0, where wi are i.i.d. vertex weights. We show that when E[w 2 1] < ∞ there is a phase transition at λc > 0 so that for λ < λc the contact process dies out in logarithmic time, and for λ > λc the contact proces...
متن کاملOptimal Reward on a Sparse Tree with Random Edge-Weights
It is well known that the maximal displacement of a random walk indexed by an m-ary tree with bounded i.i.d. edge-weights can reliably yield much larger asymptotics than a classical random walk whose summands are drawn from the same distribution. Presently we show that if the edge-weights are mean-zero, then nonclassical asymptotics arise even when the tree grows much more slowly than exponenti...
متن کاملContact Processes on Random Regular Graphs
We show that the contact process on a random d-regular graph initiated by a single infected vertex obeys the “cutoff phenomenon” in its supercritical phase. In particular, we prove that, when the infection rate is larger than the lower critical value of the contact process on the infinite d-regular tree, there are positive constants C, p depending on the infection rate such that for any ε > 0, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Mathematics in China
سال: 2017
ISSN: 1673-3452,1673-3576
DOI: 10.1007/s11464-017-0633-4